Discovering Informative Syntactic Relationships between Named Entities in Biomedical Literature.

Time%2DSlice Density Estimation for Semantic%2DBased Tourist Destination Suggestion.


Summarization for Geographically Distributed Data Streams.


Complex objects ranking a relational data mining approach.

Transductive Learning for Spatial Data Classification.

Approximate Frequent Itemset Discovery from Data Stream.

A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams.

An Iterative Learning Algorithm for Within%2DNetwork Regression in the Transductive Setting.

A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams.

Novelty Detection from Evolving Complex Data Streams with Time Windows.

Relational Frequent Patterns Mining for Novelty Detection from Data Streams.

Spatial Regression in the Transductive Setting.

Mining preference relations to rank complex object.



A relational approach to probabilistic classification in a transductive setting.

Emerging Pattern Based Classification in Relational Data Mining.


A Grid%2DBased Multi%2Drelational Approach to Process Mining.


Top%2DDown Induction of Relational Model Trees in Multi%2Dinstance Learning.

Discovering Emerging Patterns for Anomaly Detection in Network Connection Data.

Stepwise Induction of Logistic Model Trees.

Relational Classification based on Emerging Patterns.

Distributed Discovery of Multi%2DLevel Approximate Process Patterns.

Discovering Relational Emerging Patterns.
Abstract. The discovery of emerging patterns (EPs) is a descriptive data mining task defined for pre-classified data. It aims at detecting patterns which contrast two classes and has been extensively investigated for attribute-value representations. In this work we propose a method, named Mr-EP, which discovers EPs from data scattered in multiple tables of a relational database. Generated EPs can capture the differences between objects of two classes which involve properties possibly spanned in separate data tables. We implemented Mr-EP in a pre-existing multirelational data mining system which is tightly integrated with a relational DBMS, and then we tested it on two sets of geo-referenced data. 1
Stepwise Induction of Multi%2Dtarget Model Trees.

An Integrated Platform for Spatial Data Mining within a GIS Environment.

Transductive Learning from Relational Data.
Abstract. Transduction is an inference mechanism “from particular to particular”. Its application to classification tasks implies the use of both labeled (training) data and unlabeled (working) data to build a classifier whose main goal is that of classifying (only) unlabeled data as accurately as possible. Unlike the classical inductive setting, no general rule valid for all possible instances is generated. Transductive learning is most suited for those applications where the examples for which a prediction is needed are already known when training the classifier. Several approaches have been proposed in the literature on building transductive classifiers from data stored in a single table of a relational database. Nonetheless, no attention has been paid to the application of the transduction principle in a (multi-)relational setting, where data are stored in multiple tables of a relational database. In this paper we propose a new transductive classifier, named TRANSC, which is based on a probabilistic approach to making transductive inferences from relational data. This new method works in a transductive setting and employs a principled probabilistic classification in multi-relational data mining to face the challenges posed by some spatial data mining problems. Probabilistic inference allows us to compute the class probability and return, in addition to result of transductive classification, the confidence in the classification. The predictive accuracy of TRANSC has been compared to that of its inductive counterpart in an empirical study involving both a benchmark relational dataset and two spatial datasets. The results obtained are generally in favor of TRANSC, although improvements are small by a narrow margin. 1

Discovering Emerging Patterns in Spatial Databases A Multi%2Drelational Approach.
Abstract. Spatial Data Mining (SDM) has great potential in supporting public policy and in underpinning society functioning. One task in SDM is the discovery of characterization and peculiarities of communities sharing socio-economic aspects in order to identify potentialities, needs and public intervention. Emerging patterns (EPs) are a special kind of pattern which contrast two classes. In this paper, we face the problem of extracting EPs from spatial data. At this aim, we resort to a multirelational approach in order to deal with the degree of complexity of discovering EPs from spatial data (i.e., (i) the spatial dimension implicitly defines spatial properties and relations, (ii) spatial phenomena are affected by autocorrelation). Experiments on real datasets are described. 1

On Homogeneity Evaluation and Seed Selection in Clustering Relational Data.

Supporting Visual Exploration of Discovered Association Rules Through Multi%2DDimensional Scaling.

Mining Tolerance Regions with Model Trees.

Classifying Aggregated Data a Symbolic Data Analysis Approach.

Classification of symbolic objects A lazy learning approach.

Spatial associative classification propositional vs structural approach.
Abstract. Spatial associative classification takes advantage of employing association rules for spatial classification purposes. In this work, we investigate spatial associative classification in multi-relational data mining setting to deal with spatial objects having different properties, which are modeled by as many data tables (relations) as the number of spatial object types (layers). Spatial classification is based on two alternative approaches: a propositional approach and a structural approach. The propositional approach uses spatial association rules to construct an attribute-value representation (propositionalisation) of spatial data and performs spatial classification according to well-known propositional classification methods. Since the attribute-value representation should capture relational properties of spatial data, multi-relational association rules are used in propositionalisation step. The structural approach resorts to an extension of naïve Bayes classifiers to multi-relational data where the classification is driven by multi-relational association rules modelling regularities in spatial data. In both cases the spatial associative classification is performed at different levels of granularity and takes advantage from domain knowledge expressed in form of hierarchies and rules. Experiments on realworld geo-referenced census data analysis show the advantage of the structural approach over the propositional one. 1
Spatial associative classification propositional vs structural approach.
Abstract. Spatial associative classification takes advantage of employing association rules for spatial classification purposes. In this work, we investigate spatial associative classification in multi-relational data mining setting to deal with spatial objects having different properties, which are modeled by as many data tables (relations) as the number of spatial object types (layers). Spatial classification is based on two alternative approaches: a propositional approach and a structural approach. The propositional approach uses spatial association rules to construct an attribute-value representation (propositionalisation) of spatial data and performs spatial classification according to well-known propositional classification methods. Since the attribute-value representation should capture relational properties of spatial data, multi-relational association rules are used in propositionalisation step. The structural approach resorts to an extension of naïve Bayes classifiers to multi-relational data where the classification is driven by multi-relational association rules modelling regularities in spatial data. In both cases the spatial associative classification is performed at different levels of granularity and takes advantage from domain knowledge expressed in form of hierarchies and rules. Experiments on realworld geo-referenced census data analysis show the advantage of the structural approach over the propositional one. 1
Mining Relational Association Rules for Propositional Classification.

Analyzing Multi%2Dlevel Spatial Association Rules Through a Graph%2DBased Visualization.

Spatial Clustering of Structured Objects.
objects
Mining and Filtering Multi%2Dlevel Spatial Association Rules with ARES.
Abstract. In spatial data mining, a common task is the discovery of spatial association rules from spatial databases. We propose a distributed system, named ARES that takes advantage of the use of a multi-relational approach to mine spatial association rules. It supports spatial database coupling and discovery of multi-level spatial association rules as a means for spatial data exploration. We also present some criteria to bias the search and to filter the discovered rules according to user’s expectations. Finally, we show the applicability of our proposal to two different real world domains, namely, document image processing and geo-referenced analysis of census data. 1
Mining Model Trees from Spatial Data.
Abstract. Mining regression models from spatial data is a fundamental task in Spatial Data Mining. We propose a method, namely Mrs-SMOTI, that takes advantage from a tight-integration with spatial databases and mines regression models in form of trees in order to partition the sample space. The method is characterized by three aspects. First, it is able to capture both spatially global and local effects of explanatory attributes. Second, explanatory attributes that influence the response attribute do not necessarily come from a single layer. Third, the consideration that geometrical representation and relative positioning of spatial objects with respect to a reference system implicitly define both spatial relationships and properties. An application to real-world spatial data is reported. 1
Propositionalization Through Relational Association Rules Mining.

Relational Clustering with Discrete Spatial Structure.

A Data Mining Query Language for Knowledge Discovery in a Geographical Information System.

Redundant feature elimination for multi%2Dclass problems.

Spatial Associative Classification at Different Levels of Granularity A Probabilistic Approach.
Abstract. In this paper we propose a novel spatial associative classifier method based on a multi-relational approach that takes spatial relations into account. Classification is driven by spatial association rules discovered at multiple granularity levels. Classification is probabilistic and is based on an extension of naïve Bayes classifiers to multi-relational data. The method is implemented in a Data Mining system tightly integrated with an object relational spatial database. It performs the classification at different granularity levels and takes advantage from domain specific knowledge in form of rules that support qualitative spatial reasoning. An application to real-world spatial data is reported. Results show that the use of different levels of granularity is beneficial. 1
Mining interesting spatial association rules two case studies.

Top%2DDown Induction of Model Trees with Regression and Splitting Nodes.
Model trees are an extension of regression trees that associate leaves with multiple regression models. In this paper, a  method for the data-driven construction of model trees is presented, namely, the Stepwise Model Tree Induction (SMOTI) method. Its  main characteristic is the induction of trees with two types of nodes: regression nodes, which perform only straight-line regression, and  splitting nodes, which partition the feature space. The multiple linear model associated with each leaf is then built stepwise by  combining straight-line regressions reported along the path from the root to the leaf. In this way, internal regression nodes contribute to  the definition of multiple models and have a &#034;global&#034; effect, while straight-line regressions at leaves have only &#034;local&#034; effects.
Multi%2Drelational Structural Bayesian Classifier.
Abstract. In this paper we propose an extension of the naïve Bayes classification method to the multi-relational setting. In this setting, training data are stored in several tables related by foreign key constraints and each example is represented by a set of related tuples rather than a single row as in the classical data mining setting. This work is characterized by three aspects. First, an integrated approach in the computation of the posterior probabilities for each class that make use of first order classification rules. Second, the applicability to both discrete and continuous attributes by means a supervised discretization. Third, the consideration of knowledge on the data model embedded in the database schema during the generation of classification rules. The proposed method has been implemented in the new system Mr-SBC, which is tightly integrated with a relational DBMS. Testing has been performed on two datasets and four benchmark tasks. Results on predictive accuracy and efficiency are in favour of Mr-SBC for the most complex tasks. 1
Mining Model Trees A Multi%2Drelational Approach.
In many data mining tools that support regression tasks, training data  are stored in a single table containing both the target field (dependent variable)  and the attributes (independent variables). Generally, only intra-tuple  relationships between the attributes and the target field are found, while intertuple  relationships are not considered and (inter-table) relationships between  several tuples of distinct tables are not even explorable. Disregarding inter-table  relationships can be a severe limitation in many real-word applications that  involve the prediction of numerical values from data that are naturally  organized in a relational model involving several tables (multi-relational  model). In this paper, we present a new data mining algorithm, named MrSMOTI,  which induces model trees from a multi-relational model. A model tree  is a tree-structured prediction model whose leaves are associated with multiple  linear regression models. The particular feature of Mr-SMOTI is that internal  nodes of the induced model tree can be of two types: regression nodes, which  add a variable to some multiple linear models according to a stepwise strategy,  and split nodes, which perform tests on attributes or the join condition and  eventually partition the training set. The induced model tree is a multi-relational  pattern that can be represented by means of selection graphs, which can be  translated into SQL, or equivalently into first order logic expressions.
Comparing Simplification Methods for Model Trees with Regression and Splitting Nodes.
Abstract. In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes and splitting nodes. We propose two methods which are based on two distinct simplification operators, namely pruning and grafting. Theoretical properties of the methods are reported and the effect of the simplification on several data sets is empirically investigated. Results are in favor of simplified trees in most cases. 1
MR%2DSMOTI A Data Mining System for Regression Tasks Tightly%2DCoupled with a Relational Database.

Simplification Methods for Model Trees with Regression and Splitting Nodes.
Abstract. In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes and splitting nodes. We propose two methods which are based on two distinct simplification operators, namely pruning and grafting. Theoretical properties of the methods are reported and the effect of the simplification on several data sets is empirically investigated. Results are in favor of simplified trees in most cases. 1
Mr%2DSBC A Multi%2Drelational Na%EFve Bayes Classifier.

Stepwise Model Tree Induction in a Multi%2DRelational Framework.

Empowering a GIS with inductive learning capabilities the case of INGENS.
Informationgfor intopog)A2(U map captions or in GIS models is often insu#cient to recog737 interesting gerestingU patterns. Some prototypes of GIS have already been extended with a knowledg--8U(A and somereasoning capabilities to support sophisticated map interpretation processes. Nevertheless, the acquisition of the necessary knowledg is still a demanding task for which machinelearning techniques can be ofgA(7 help. This paper presents INGENS, a prototypical GIS whichinteg757U machinelearning tools to assist users in the task oftopogA273) map interpretation. The system can be trained to learn operational definitions of gC35UA27(3( objects that are not explicitly modeled in the database. INGENS has been applied to the task of Apulian map interpretation in order to discovergcoverA(6 knowledg of interest to town planners.
Mining Model Trees with Regression and Splitting Nodes.

Empowering a GIS with inductive learning capabilities the case of INGENS.
Informationgfor intopog)A2(U map captions or in GIS models is often insu#cient to recog737 interesting gerestingU patterns. Some prototypes of GIS have already been extended with a knowledg--8U(A and somereasoning capabilities to support sophisticated map interpretation processes. Nevertheless, the acquisition of the necessary knowledg is still a demanding task for which machinelearning techniques can be ofgA(7 help. This paper presents INGENS, a prototypical GIS whichinteg757U machinelearning tools to assist users in the task oftopogA273) map interpretation. The system can be trained to learn operational definitions of gC35UA27(3( objects that are not explicitly modeled in the database. INGENS has been applied to the task of Apulian map interpretation in order to discovergcoverA(6 knowledg of interest to town planners.
Discovery of spatial association rules in geo%2Dreferenced census data A relational mining approach.
Census data mining has great potential both in business development and in good public policy, but still must be solved in this field a number of research issues. In this paper, problems related to the geo-referenciation of census data are considered. In particular, the accommodation of the spatial dimension in census data mining is investigated for the task of discovering spatial association rules, that is, association rules involving spatial relations among (spatial) objects. The formulation of a new method based on a multi-relational data mining approach is proposed. It takes advantage of the representation and inference techniques developed in the field of Inductive Logic Programming (ILP). In particular, the expressive power of predicate logic is profitably used to represent both spatial relations and background knowledge, such as spatial hierarchies and rules for spatial qualitative reasoning. The logical notions of generality order and of the downward refinement operator on the space of patterns are profitably used to define both the search space and the search strategy. The proposed method has been implemented in the ILP system SPADA (Spatial Pattern Discovery Algorithm). SPADA has been interfaced both to a module for the extraction of spatial features from a spatial database and to a module for numerical attribute discretization. The three modules have been used in an application to urban accessibility of a hospital in Stockport, Greater Manchester. Results obtained through a spatial analysis of geo-referenced census data are illustrated.
Trading%2DOff Local versus Global Effects of Regression Nodes in Model Trees.
Model trees are an extension of regression trees that associate leaves  with multiple regression models. In this paper a method for the top-down  induction of model trees is presented, namely the Stepwise Model Tree  Induction (SMOTI) method. Its main characteristic is the induction of trees with  two types of nodes: regression nodes, which perform only straight-line  regression, and split nodes, which partition the sample space. The multiple  linear model associated to each leaf is then obtained by combining straight-line  regressions reported along the path from the root to the leaf. In this way,  internal regression nodes contribute to the definition of multiple models and  have a &#034;global&#034; effect, while straight-line regressions at leaves have only  &#034;local&#034; effects. This peculiarity of SMOTI has been evaluated in an empirical  study involving both real and artificial data.
KDB2000 Uno strumento per la scoperta della conoscenza.

Mining Classification and Association Rules in Geographical Data with SDMOQL.

KDB2000 Uno strumento per la scoperta della conoscenza.

Stepwise Induction of Model Trees.
Regression trees are tree-based models used to solve those prediction  problems in which the response variable is numeric. They differ from the  better-known classification or decision trees only in that they have a numeric  value rather than a class label associated with the leaves. Model trees are an  extension of regression trees in the sense that they associate leaves with  multivariate linear models. In this paper a method for the data-driven  construction of model trees is presented, namely the Stepwise Model Tree  Induction (SMOTI) method. Its main characteristic is the induction of trees with  two types of nodes: regression nodes, which perform only straight-line  regression, and splitting nodes, which partition the sample space. In this way,  the multivariate linear model associated to each leaf is efficiently built stepwise.
Generating Logic Descriptions for the Automated Interpretation of Topographic Maps.
Automating the interpretation of a map in order to locate some  geographical objects and their relations is a challenging task, which goes  beyond the transformation of map images into a vectorized representation and  the recognition of symbols. In this work, we present an approach to the  automated interpretation of vectorized topographic maps. It is based on the  generation of logic descriptions of maps and the application of symbolic  Machine Learning tools to these descriptions. This paper focuses on the  definition of computational methods for the generation of logic descriptions of  map cells and briefly describes the use of these logic descriptions in an  inductive learning task.
